Generalized Null Space and Restricted Isometry Properties

نویسندگان

  • Tomer Peleg
  • Rémi Gribonval
  • Mike E. Davies
چکیده

We propose a theoretical study of the conditions guaranteeing that a decoder will obtain an optimal signal recovery from an underdetermined set of linear measurements. This special type of performance guarantee is termed instance optimality and is typically related with certain properties of the dimensionality-reducing matrix M. Our work extends traditional results in sparse recovery, where instance optimality is expressed with respect to the set of sparse vectors, by replacing this set with an arbitrary finite union of subspaces. We show that the suggested instance optimality is equivalent to a generalized null space property of M and discuss possible relations with generalized restricted isometry properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the gap between restricted isometry properties and sparse recovery conditions

We consider the problem of recovering sparse vectors from underdetermined linear measurements via `pconstrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that two phenomena occur if p 6= 2. First, one may need substantially more than s log(en/s) measurements (optimal for p = 2) for uniform recovery of all s-sparse vectors...

متن کامل

The gap between the null space property and the restricted isomety property

The null space property (NSP) and the restricted isometry property (RIP) are two properties which have received considerable attention in the compressed sensing literature. As the name suggests, NSP is a property that depends solely on the null space of the measurement procedure and as such, any two matrices which have the same null space will have NSP if either one of them does. On the other h...

متن کامل

Sparse Recovery on Euclidean Jordan Algebras

We consider the sparse recovery problem on Euclidean Jordan algebra (SREJA), which includes sparse signal recovery and low-rank symmetric matrix recovery as special cases. We introduce the restricted isometry property, null space property (NSP), and s-goodness for linear transformations in s-sparse element recovery on Euclidean Jordan algebra (SREJA), all of which provide sufficient conditions ...

متن کامل

A new condition for stable recovery of sparse signals from noisy measurements

The null space property and the restricted isometry property for a measurement matrix are two basic properties in compressive sampling, and are closely related to the sparse approximation. In this paper, we introduce the sparse approximation property of order s for a measurement matrix A: ‖xs‖2 ≤ D‖Ax‖2 + β σs(x) √ s for all x, where xs is the best s-sparse approximation of the vector x in `, σ...

متن کامل

On Partially Sparse Recovery

In this paper we consider the problem of recovering a partially sparse solution of an underdetermined system of linear equations by minimizing the `1-norm of the part of the solution vector which is known to be sparse. Such a problem is closely related to the classical problem in Compressed Sensing where the `1-norm of the whole solution vector is minimized. We introduce analogues of restricted...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013